On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
نویسندگان
چکیده
P. Baumgartner, R. Hähnle & J. Posegga, ed., 4 International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 95), LNAI 918, pp. 106–121, c ©Springer Verlag, 1995 Abstract. We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying his matrix characterization for the validity of intuitionistic formulae. Since this proof makes use of Fitting‘s non-standard sequent calculus our procedure consists of two steps. First a non-standard sequent proof will be extracted from a given matrix proof. Secondly we transform each non-standard proof into a standard proof in a structure preserving way. To simplify the latter step we introduce an extended standard calculus which is shown to be sound and complete.
منابع مشابه
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified representations of matrix characterizations, of sequent calculi, and of prefixed sequent systems for various logics. The peculiarities of an individual logic are described by certain parameters of these representations, which are su...
متن کاملGuiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s connection method for classical predicate logic. It generates a matrix proof which will then be transformed into a proof within a standard sequent calculus. Thus we can use an efficient proof method to guide the development ...
متن کاملOn a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus
In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cut-elimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction. Then we define a reduction relation on those proofs that exactly corresponds to normalization in natural d...
متن کاملA Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs
In this paper, we show that an intuitionistic logic with second-order function quantiication, called hh 2 here, can serve as a metalanguage to directly and naturally specify both sequent calculi and natural deduction inference systems for rst-order logic. For the intuitionistic subset of rst-order logic, we present a set of hh 2 formulas which simultaneously speciies both kinds of inference sys...
متن کاملFocused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کامل